The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
نویسندگان
چکیده
منابع مشابه
Dynamic Atomic Congestion Games with Seasonal Flows
We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We give a precise description of the dynamics induced by the individual strategies of players and of the corresponding costs, either when the traffic is control...
متن کاملThe Equilibrium Existence Problem in Finite Network Congestion Games
An open problem is presented regarding the existence of pure strategy Nash equilibrium (PNE) in network congestion games with a finite number of non-identical players, in which the strategy set of each player is the collection of all paths in a given network that link the player’s origin and destination vertices, and congestion increases the costs of edges. A network congestion game in which th...
متن کاملAtomic Congestion Games with Taxes on Resources
Introduction We consider the following network problem: there are finite number of users in the network. Each user has a non-negligible (or atomic) amount of demand and wants to route her demand from her source to her sink through multiple paths. For each edge in the network, there exists congestion for per unit of flow, which depends on the total amount of flow on this edge. The cost of a user...
متن کاملNew Complexity Results and Algorithms for the Minimum Tollbooth Problem
The inefficiency of the Wardrop equilibrium of nonatomic routing games can be eliminated by placing tolls on the edges of a network so that the socially optimal flow is induced as an equilibrium flow. A solution where the minimum number of edges are tolled may be preferable over others due to its ease of implementation in real networks. In this paper we consider the minimum tollbooth (MINTB) pr...
متن کاملMarginal cost pricing for Atomic Network Congestion Games
We study optimal tolls for network congestion games where players aim to route certain amount of traffic between various source destination pairs. We consider weighted atomic users, unsplittable traffic and arbitrary nondecreasing latency functions. Users are selfish and want to follow routes that minimize their respective latencies. We focus on pure Nash equilibria. A Nash equilibrium profile ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2021
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-021-10038-9